kw.\*:("Parallel graph algorithms")
Results 1 to 5 of 5
Selection :
Accelerating CUDA Graph Algorithms at Maximum WarpHONG, Sungpack; SANG KYUN KIM; OGUNTEBI, Tayo et al.ACM SIGPLAN notices. 2011, Vol 46, Num 8, pp 267-276, issn 1523-2867, 10 p.Conference Paper
A scalable, parallel algorithm for maximal clique enumerationSCHMIDT, Matthew C; SAMATOVA, Nagiza F; THOMAS, Kevin et al.Journal of parallel and distributed computing (Print). 2009, Vol 69, Num 4, pp 417-428, issn 0743-7315, 12 p.Article
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphsBADER, David A; GUOJING CONG.Journal of parallel and distributed computing (Print). 2006, Vol 66, Num 11, pp 1366-1378, issn 0743-7315, 13 p.Article
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)BADER, David A; GUOJING CONG.Journal of parallel and distributed computing (Print). 2005, Vol 65, Num 9, pp 994-1006, issn 0743-7315, 13 p.Article
Lifting sequential graph algorithms for distributed-memory parallel computationGREGOR, Douglas; LUMSDAINE, Andrew.ACM SIGPLAN notices. 2005, Vol 40, Num 10, pp 423-437, issn 1523-2867, 15 p.Conference Paper